Fibonacci Decimal Number Patterns Via the Generating Function
نویسندگان
چکیده
منابع مشابه
The Generating Function of the Generalized Fibonacci Sequence
Using tools of the theory of orthogonal polynomials we obtain the generating function of the generalized Fibonacci sequence established by Petronilho for a sequence of real or complex numbers {Qn}n=0 defined by Q0 = 0, Q1 = 1, Qm = ajQm 1 + bjQm 2, m ⌘ j (mod k), where k 3 is a fixed integer, and a0, a1, . . . , ak 1, b0, b1, . . . , bk 1 are 2k given real or complex numbers, with bj 6= 0 for 0...
متن کاملThe Fibonacci Zeta Function
We consider the lacunary Dirichlet series obtained by taking the reciprocals of the s-th powers of the Fibonacci numbers. This series admits an analytic continuation to the entire complex plane. Its special values at integral arguments are then studied. If the argument is a negative integer, the value is algebraic. If the argument is a positive even integer, the value is transcendental by Neste...
متن کاملPromoting Decimal Number Sense and Representational Fluency
tThe abstract nature of mathematics requires the communication of mathematical ideas through multiple representations, such as words, symbols, pictures, objects, or actions. Building representational fluency involves using mathematical representations flexibly and being able to interpret and translate among these different models and mathematical concepts. This article shares a collaborative le...
متن کاملA Mthod for Generating the Turbulent Intermittency Function
A detection method based on sensitization of a squared double differentiated signal is developed which discriminates the turbulent zones from laminar zones quite accurately. The procedure adopts a variable threshold and a variable hold time of the order of the Kolmogorov time scale. The output file so generated, includes all the information for further analysis of the turbulent signal.
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 1990
ISSN: 0899-6180
DOI: 10.35834/1990/0203137